#Driver file to run the code for hte bfhs
import Node, Queue

search = Queue.PriorityQueue(0) #the search priority queue
closedList = {} #dictionary functions as a hashmap.  stored examined nodes with key/val pairs


search.put((30, "third")) #testing the priority queue
search.put((10,"first"))
search.put((20, "second"))

while not search.empty():
    print search.get()


